SOLVING OPTIMIZATION PROBLEM USING MATLAB PACKAGE
نویسندگان
چکیده
منابع مشابه
Solving the Airline Recovery Problem By Using Ant Colony Optimization
In this paper an Ant Colony (ACO) algorithm is developed to solve aircraft recovery while considering disrupted passengers as part of objective function cost. By defining the recovery scope, the solution always guarantees a return to the original aircraft schedule as soon as possible which means least changes to the initial schedule and ensures that all downline affects of the disruption are ...
متن کاملOptimization Problem Solving System using GridRPC
In recent years, the Grid has been standardized with an emphasis on efficient services integration over the wide area network. We focus on applications integration for solving complex optimization problems on the Grid. Then, the framework of applications integration using the GridRPC is proposed. In this framework, each service on the Grid has four basic functions that enable an end-user to inv...
متن کاملSDLS: a Matlab package for solving conic least-squares problems
This document is an introduction to the Matlab package SDLS (Semi-Definite Least-Squares) for solving least-squares problems over convex symmetric cones. The package is shortly presented through the addressed problem, a sketch of the implemented algorithm, the syntax and calling sequences, a simple numerical example and some more advanced features. The implemented method consists in solving the...
متن کاملsolving quadratic assignment problem (qap) using invasive weed optimization algorithm
a new powerful optimization algorithm inspired from colonizing weeds is utilized to solve the well-known quadratic assignment problem (qap) which is of application in a large number of practical areas such as plant layout, machinery layout and so on. a set of reference numerical problems from qaplib is taken in order to evaluate the efficiency of the algorithm compared with the previous ones wh...
متن کاملHOPT – A MATLAB Package for Constrained Optimization in Hardy Spaces
where f̂k = ∫ π −π f(θ)e −ikθ dθ, k ∈ Z, are the Fourier coefficients of f . Further, we assume that g ∈ C(∂D) with g > 0, that K ⊂ ∂D is closed and has positive measure (in practice, K will be an interval or a collection of intervals on ∂D), and that φ ∈ C(K) with |φ| ≤ g on K. Finally, we assume that g, φ and K are symmetric, i.e., φ(e) = φ(e−iθ), g(e) = g(e), and K = K. Under these assumption...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Journal of Polonia University
سال: 2018
ISSN: 2543-8204,1895-9911
DOI: 10.23856/3106